Secret Image Sharing Based on Chaotic Map and Chinese Remainder Theorem
نویسندگان
چکیده
Secret sharing is an efficient method for transmitting the image securely. This paper proposes an efficient secret sharing scheme for secret image. The protocol allows each participant to share a secret gray image with the rest of participants. In our scheme, a secret digital image is divided into n pieces, which are further distributed into n participants. The secret digital image can be reconstructed if and only if r or more legal participants cooperate together. These schemes have no pixel expansion. It is general in nature and can be applied on any image size. The proposed scheme is based on the chaotic map and the Chinese Remainder theorem. The security of the scheme is analyzed and the protocol is proven to be secure and be able to resist statistic and exhaustive attacks.
منابع مشابه
Multilevel Threshold Secret Image Sharing based on the Chinese Remainder Theorem
(t, n)-threshold secret sharing was first introduced by Shamir and Blakley separately in 1979. Apart from this, there are threshold secret sharing schemes which use the Chinese Remainder Theorem (CRT). The above mentioned are three of the most extensively researched tools used for designing a (t, n)-threshold secret sharing scheme. In this paper we propose a scheme for Multilevel Threshold Secr...
متن کاملGeneral Secret Sharing Based on the Chinese Remainder Theorem
In this paper we extend the threshold secret sharing schemes based on the Chinese remainder theorem in order to deal with more general access structures. Aspects like verifiability, secret sharing homomorphisms and multiplicative properties are also discussed. AMS Subject Classification: 94A62, 11A07
متن کاملGeneral Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Threshold secret sharing based on the Chinese remainder theorem has been considered by Mignotte [23] and Asmuth and Bloom [1]. In this paper we demonstrate that the Chinese remainder theorem can be used for realizing more general access structures, as the compartmented or the weighted threshold ones. We also prove that there exist some non-weighted threshold access structures whose realizations...
متن کاملLossless and unlimited multi-image sharing based on Chinese remainder theorem and Lagrange interpolation
This study proposes a novel multi-image threshold sharing scheme based on Chinese remainder theorem and Lagrange interpolation. The exceptional property of the scheme is its ability to retrieve any secret image without recovering all the other images. Therefore, it works efficiently and reduces computation cost in case it needs to recover only one image from shares. In term of capacity, the sch...
متن کاملRobust Threshold Schemes Based on the Chinese Remainder Theorem
Recently, Chinese Remainder Theorem (CRT) based function sharing schemes are proposed in the literature. In this paper, we investigate how a CRT-based threshold scheme can be enhanced with the robustness property. To the best of our knowledge, these are the first robust threshold cryptosystems based on a CRT-based secret sharing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJWMIP
دوره 10 شماره
صفحات -
تاریخ انتشار 2012